data dependence造句
例句與造句
- In some sense , our data dependence analysis is an exact method
靜態(tài)測(cè)試在限定的范圍內(nèi)是精確測(cè)試。 - We also describe a dynamic method of detecting data dependence
同時(shí)，我們還提出了判斷數(shù)據(jù)相關(guān)性的動(dòng)態(tài)測(cè)試。 - Simulation results show that this two methods can detect data dependence not only exactly but also efficiently
模擬結(jié)果表明，該算法能夠獲得8 . 7的加速比。 - In this paper we propose a new simple approach for analyzing data dependence on dlx code using register queues
與常用的基于數(shù)據(jù)流圖的方法不同，我們提出了一種通過(guò)寄存器隊(duì)列檢測(cè)指令間寄存器數(shù)據(jù)相關(guān)的算法。 - While executing the program , we memorize all the values of each array variable . the analysis will stop if data dependence is found
動(dòng)態(tài)測(cè)試就是在解釋執(zhí)行程序的同時(shí)，記錄串行程序?qū)?shù)組元素的訪問(wèn)，如果發(fā)現(xiàn)數(shù)據(jù)相關(guān)就終止測(cè)試。 - It's difficult to find data dependence in a sentence. 用data dependence造句挺難的
- Although it is not an exact method in data dependence analysis , it can also process some difficult problems , for example , programs with complex subscripts in loops
動(dòng)態(tài)測(cè)試是基于我們假設(shè)如果循環(huán)中存在數(shù)據(jù)相關(guān)，那么在循環(huán)的有限幾次迭代中就會(huì)出現(xiàn)數(shù)據(jù)相關(guān)。 - The most common analysis is data dependence analysis , which is to determine the i tructio that use the variable ( register or memory location ) modified by another i truction
最通常的分析是數(shù)據(jù)依存性分析，它用來(lái)確定指令使用的變量（寄存器或內(nèi)存位置）是否被另一條指令修改。 - The most common analysis is data dependence analysis , which is to determine the instructions that use the variable ( register or memory location ) modified by another instruction
最通常的分析是數(shù)據(jù)依存性分析，它用來(lái)確定指令使用的變量（寄存器或內(nèi)存位置）是否被另一條指令修改。 - We can also find unexecutable paths of the sequential program . when we find them we will stop the analysis . we enhance the capability of the traditional methods of detecting data dependence
我們采用了遍歷程序路徑和對(duì)路徑進(jìn)行符號(hào)執(zhí)行的策略，這樣可以盡可能早的發(fā)現(xiàn)程序中的不可執(zhí)行路徑，從而提高分析的效率。 - In static analysis , we generate the control flow graph of the sequential program and convert the graph to an extended finite state machine ( efsm ) . by analyzing the paths of the efsm , we can find whether there is data dependence in the program or not
數(shù)據(jù)相關(guān)性的靜態(tài)測(cè)試中，我們首先生成程序的流程圖，在遍歷流程圖的同時(shí)生成這個(gè)程序的擴(kuò)展有限狀態(tài)機(jī)( efsm ) ，然后調(diào)用路徑分析工具對(duì)efsm的路徑進(jìn)行分析。 - Because the dynamic schedule technique cannot eliminate the data dependence in quantum instructions , we have proposed a parallel quantum computing model ( pqcm ) based on quantum network model to resolve this problem . we also analyzed the parallelism in quantum network , and give the analyzing and recomposing algorithm
在量子網(wǎng)絡(luò)計(jì)算模型的基礎(chǔ)上，深入分析了量子網(wǎng)絡(luò)中存在的并行性，提出了并行量子計(jì)算模型，研究了開(kāi)發(fā)量子網(wǎng)絡(luò)并行性的方法，提出了量子網(wǎng)絡(luò)并行化重構(gòu)算法。 - There are three key factors baffle the sma processor : context load imbalance , inter - thread control dependence and inter - thread data dependence . to maintain performance boost , the sma compiler must eliminate those factors thoroughly . the work of this paper include : 1 the paper thoroughly investigates execution behavior of various applications on sma architecture
主要的工作與創(chuàng)新點(diǎn)包括： 1研究了sma結(jié)構(gòu)各種主要程序結(jié)構(gòu)的適應(yīng)性和性能優(yōu)化特性，確定了sma模型的關(guān)鍵性能要素：現(xiàn)場(chǎng)間負(fù)載不均衡、線程間控制前瞻失效與線程間數(shù)據(jù)前瞻失效。 - One of the key elements to achieving higher performance in microprocessors is executing more instructions per cycle . however , dependencies among instructions , varying latencies of certain instructions , and execution resources constraints , limit this parallelism considerably . in order to exploit instruction level parallelism , processor should employ data dependence analysis to identify independent instructions that can execute in parallel
當(dāng)前，在微處理器體系結(jié)構(gòu)研究中，為了充分提高微處理器的處理性能，主要采用了指令級(jí)并行技術(shù)( ilp ) ，指令級(jí)并行性的開(kāi)發(fā)程度對(duì)發(fā)揮微處理器的硬件特性，提高程序運(yùn)行性能至為關(guān)鍵。 - In both cases we can derive data dependences from reaching definitions and uses information obtained by data flow analysis . at schedule time true register dependencies are known , so register analysis does not involve any complication . but for memory dependencies we have to deal with the problem of aliasing ( addresses are computed during execution )
而對(duì)于存儲(chǔ)器訪問(wèn)指令而言，其相關(guān)性分析則相對(duì)復(fù)雜得多，關(guān)鍵問(wèn)題是必須解決存儲(chǔ)器訪問(wèn)地址的別名問(wèn)題( aliasingproblem ) ，即必須判斷出對(duì)存儲(chǔ)器的兩次訪問(wèn)是否針對(duì)同一個(gè)地址單元，然后在此基礎(chǔ)上進(jìn)行存儲(chǔ)器訪問(wèn)的數(shù)據(jù)相關(guān)性分析。 - In this thesis , we will review some traditional methods of detecting data dependence and analyze the relation between the data dependence and the mechanism of parallelism . based on path analysis and symbolic execution , we describe two methods , static analysis and dynamic analysis , for detecting data dependence of array variables in loops of sequential programs
進(jìn)而提出了基于路徑分析和符號(hào)執(zhí)行的靜態(tài)測(cè)試和動(dòng)態(tài)測(cè)試方法，來(lái)研究串行程序中循環(huán)內(nèi)部數(shù)組變量的數(shù)據(jù)相關(guān)性，該方法對(duì)于下標(biāo)表達(dá)式為線性表達(dá)式時(shí)有很好的效果，而且能夠處理一些復(fù)雜的數(shù)組下標(biāo)表達(dá)式，比如數(shù)組下標(biāo)表達(dá)式含有輸入變量和非線性下標(biāo)表達(dá)式的情況。